Learning Indices for Schema Selection
نویسنده
چکیده
In addition to learning new knowledge, a system must be able to learn when the knowledge is likely to be applicable. An index is a piece of information which, when identiied in a given situation, triggers the relevant piece of knowledge (or schema) in the system's memory. We discuss the issue of how indices may be learned automatically in the context of a story understanding task, and present a program that can learn new indices for existing explanatory schemas. We discuss two methods using which the system can identify the relevant schema even if the input does not directly match an existing index, and learn a new index to allow it to retrieve this schema more eeciently in the future.
منابع مشابه
Index Selection for Embedded Control Applications using Description Logics
We consider the problem of automated index selection for embedded control programs (ECPs). Such systems have the property that the transaction types, which can consist of queries and updates, are predefined and can be classified as either critical or non-critical. In this paper, we focus on the critical part of the transaction workload for ECPs. More precisely, our problem input consists of a s...
متن کاملTOPYDE: A Tool for Physical Database Design
We describe a tool for physical database design based on a combination of theoretical and pragmatic approaches. The tool takes as input a relational schema, the workload defined on the schema, and some additional database characteristics and produces as output a physical schema. For the time being, the tool is tuned towards Ingres. 1 Introduction The design of databases takes place on several l...
متن کاملDatabase Schema Matching Using Machine Learning with Feature Selection
Schema matching, the problem of finding mappings between the attributes of two semantically related database schemas, is an important aspect of many database applications such as schema integration, data warehousing, and electronic commerce. Unfortunately, schema matching remains largely a manual, labor-intensive process. Furthermore, the effort required is typically linear in the number of sch...
متن کاملAutomatch Revisited
We revisit the Autoplex and Automatch projects from 2001–2005, and in particular the results reported in the paper Database Schema Matching Using Machine Learning with Feature Selection, presented in the 14th International Conference on Advanced Information Systems Engineering (2002). We provide the motivation and background for these projects, examine their impact a decade later, and sketch po...
متن کاملXIST: An XML Index Selection Tool
XML indices are essential for efficiently processing XML queries which typically have predicates on both structures and values. Since the number of all possible structural and value indices is large even for a small XML document with a simple structure, XML DBMSs must carefully choose which indices to build. In this paper, we propose a tool, called XIST, that can be used by an XML DBMS as an in...
متن کامل